type github.com/klauspost/compress/flate.tableEntry
91 uses
github.com/klauspost/compress/flate (current package)
fast_encoder.go#L68: type tableEntry struct {
fast_encoder.go#L103: Cur tableEntry
fast_encoder.go#L104: Prev tableEntry
level1.go#L14: table [tableSize]tableEntry
level1.go#L32: e.table[i] = tableEntry{}
level1.go#L79: var candidate tableEntry
level1.go#L89: e.table[nextHash] = tableEntry{offset: s + e.cur}
level1.go#L94: e.table[nextHash] = tableEntry{offset: nextS + e.cur}
level1.go#L104: e.table[nextHash] = tableEntry{offset: s + e.cur}
level1.go#L108: e.table[nextHash] = tableEntry{offset: nextS + e.cur}
level1.go#L204: e.table[hashLen(cv, tableBits, hashBytes)] = tableEntry{offset: s + e.cur}
level1.go#L218: e.table[prevHash] = tableEntry{offset: o}
level1.go#L222: e.table[currHash] = tableEntry{offset: o + 2}
level2.go#L10: table [bTableSize]tableEntry
level2.go#L30: e.table[i] = tableEntry{}
level2.go#L77: var candidate tableEntry
level2.go#L87: e.table[nextHash] = tableEntry{offset: s + e.cur}
level2.go#L92: e.table[nextHash] = tableEntry{offset: nextS + e.cur}
level2.go#L102: e.table[nextHash] = tableEntry{offset: s + e.cur}
level2.go#L160: e.table[hashLen(cv, bTableBits, hashBytes)] = tableEntry{offset: s + e.cur}
level2.go#L169: e.table[nextHash] = tableEntry{offset: e.cur + i}
level2.go#L173: e.table[nextHash] = tableEntry{offset: e.cur + i + 2}
level2.go#L177: e.table[nextHash] = tableEntry{offset: e.cur + i + 4}
level2.go#L190: e.table[prevHash] = tableEntry{offset: o}
level2.go#L191: e.table[prevHash2] = tableEntry{offset: o + 1}
level2.go#L194: e.table[currHash] = tableEntry{offset: o + 2}
level3.go#L77: var candidate tableEntry
level3.go#L90: e.table[nextHash] = tableEntryPrev{Prev: candidates.Cur, Cur: tableEntry{offset: s + e.cur}}
level3.go#L173: Cur: tableEntry{offset: e.cur + t},
level3.go#L184: Cur: tableEntry{offset: e.cur + i}}
level3.go#L193: Cur: tableEntry{offset: e.cur + s - 2},
level3.go#L200: Cur: tableEntry{offset: e.cur + s - 1},
level3.go#L208: Cur: tableEntry{offset: s + e.cur},
level4.go#L7: table [tableSize]tableEntry
level4.go#L8: bTable [tableSize]tableEntry
level4.go#L24: e.table[i] = tableEntry{}
level4.go#L27: e.bTable[i] = tableEntry{}
level4.go#L96: entry := tableEntry{offset: s + e.cur}
level4.go#L172: e.table[hashLen(cv, tableBits, hashShortBytes)] = tableEntry{offset: s + e.cur}
level4.go#L173: e.bTable[hash7(cv, tableBits)] = tableEntry{offset: s + e.cur}
level4.go#L183: t := tableEntry{offset: i + e.cur}
level4.go#L184: t2 := tableEntry{offset: t.offset + 1}
level4.go#L192: t := tableEntry{offset: i + e.cur}
level4.go#L193: t2 := tableEntry{offset: t.offset + 1}
level4.go#L207: e.table[prevHashS] = tableEntry{offset: o}
level4.go#L208: e.bTable[prevHashL] = tableEntry{offset: o}
level5.go#L7: table [tableSize]tableEntry
level5.go#L25: e.table[i] = tableEntry{}
level5.go#L104: entry := tableEntry{offset: s + e.cur}
level5.go#L116: e.table[nextHashS] = tableEntry{offset: nextS + e.cur}
level5.go#L118: eLong.Cur, eLong.Prev = tableEntry{offset: nextS + e.cur}, eLong.Cur
level5.go#L135: e.table[nextHashS] = tableEntry{offset: nextS + e.cur}
level5.go#L137: eLong.Cur, eLong.Prev = tableEntry{offset: nextS + e.cur}, eLong.Cur
level5.go#L149: e.table[nextHashS] = tableEntry{offset: nextS + e.cur}
level5.go#L151: eLong.Cur, eLong.Prev = tableEntry{offset: nextS + e.cur}, eLong.Cur
level5.go#L260: t := tableEntry{offset: i + e.cur}
level5.go#L267: t = tableEntry{offset: t.offset + 1}
level5.go#L273: t = tableEntry{offset: t.offset + 1}
level5.go#L280: t := tableEntry{offset: i + e.cur}
level5.go#L281: t2 := tableEntry{offset: t.offset + 1}
level5.go#L295: e.table[prevHashS] = tableEntry{offset: o}
level5.go#L297: eLong.Cur, eLong.Prev = tableEntry{offset: o}, eLong.Cur
level5.go#L318: table [tableSize]tableEntry
level5.go#L337: e.table[i] = tableEntry{}
level5.go#L416: entry := tableEntry{offset: s + e.cur}
level5.go#L428: e.table[nextHashS] = tableEntry{offset: nextS + e.cur}
level5.go#L430: eLong.Cur, eLong.Prev = tableEntry{offset: nextS + e.cur}, eLong.Cur
level5.go#L447: e.table[nextHashS] = tableEntry{offset: nextS + e.cur}
level5.go#L449: eLong.Cur, eLong.Prev = tableEntry{offset: nextS + e.cur}, eLong.Cur
level5.go#L461: e.table[nextHashS] = tableEntry{offset: nextS + e.cur}
level5.go#L463: eLong.Cur, eLong.Prev = tableEntry{offset: nextS + e.cur}, eLong.Cur
level5.go#L572: t := tableEntry{offset: i + e.cur}
level5.go#L579: t = tableEntry{offset: t.offset + 1}
level5.go#L585: t = tableEntry{offset: t.offset + 1}
level5.go#L592: t := tableEntry{offset: i + e.cur}
level5.go#L593: t2 := tableEntry{offset: t.offset + 1}
level5.go#L607: e.table[prevHashS] = tableEntry{offset: o}
level5.go#L609: eLong.Cur, eLong.Prev = tableEntry{offset: o}, eLong.Cur
level6.go#L7: table [tableSize]tableEntry
level6.go#L25: e.table[i] = tableEntry{}
level6.go#L105: entry := tableEntry{offset: s + e.cur}
level6.go#L120: e.table[nextHashS] = tableEntry{offset: nextS + e.cur}
level6.go#L122: eLong.Cur, eLong.Prev = tableEntry{offset: nextS + e.cur}, eLong.Cur
level6.go#L141: e.table[nextHashS] = tableEntry{offset: nextS + e.cur}
level6.go#L143: eLong.Cur, eLong.Prev = tableEntry{offset: nextS + e.cur}, eLong.Cur
level6.go#L157: e.table[nextHashS] = tableEntry{offset: nextS + e.cur}
level6.go#L159: eLong.Cur, eLong.Prev = tableEntry{offset: nextS + e.cur}, eLong.Cur
level6.go#L290: e.table[hashLen(cv, tableBits, hashShortBytes)] = tableEntry{offset: i + e.cur}
level6.go#L292: eLong.Cur, eLong.Prev = tableEntry{offset: i + e.cur}, eLong.Cur
level6.go#L301: t := tableEntry{offset: i + e.cur}
level6.go#L302: t2 := tableEntry{offset: t.offset + 1}
|
The pages are generated with Golds v0.6.7. (GOOS=linux GOARCH=amd64)
Golds is a Go 101 project developed by Tapir Liu.
PR and bug reports are welcome and can be submitted to the issue list.
Please follow @Go100and1 (reachable from the left QR code) to get the latest news of Golds. |